Moment-based metrics for mesh simplification
نویسندگان
چکیده
منابع مشابه
Moment-based metrics for mesh simplification
Moment-based metrics for mesh simplification H. Tang 2, 3, , H. Z. Shu , J. L. Dillenseger 3, , X. D. Bao , L. M. Luo 4 Laboratory of Image Science and Technology, Department of Computer Science and Engineering, Southeast University, 210096, Nanjing, China INSERM, U642, Rennes, F-35000, France Université de Rennes 1, LTSI, Rennes, F-35000, France Centre de Recherche en Information Biomédicale S...
متن کاملTopology Sensitive Volume Mesh Simplification with Planar Quadric Error Metrics
We introduce an algorithm for fast topology-sensitive decimation of volume meshes. The algorithm employs a planar quadric error metric to guarantee minimum geometric error at every simplification step, while maintaining the input mesh's geometric consistency, and restraining changes to its topological genus, at low computational costs. The proposed method presents a new alternative to existing ...
متن کاملMesh Simplification Based on Shading Characteristic
Mesh simplification is a key research area in scientific visualization and virtual reality. The paper presents a new method of polyhedral model simplification based on vision characteristic and edge collapse. This method determines model’s vision characteristic by computing the maximum product of angle between normal of vertex and adjacent triangles with area of these triangles. It can achieve ...
متن کاملMesh Surface Simplification Based on Constrained Energy
A triangle-mesh-surface-simplification algorithm based on a constrained energy function is proposed. In the algorithm, vertices are deleted iteratively according to the dimension-less energy function, which represents the cost of surface modification by vertex deletion and subsequent hole re-triangulation. The energy function is used both for selecting a vertex with the minimum energy for delet...
متن کاملDecimating samples for mesh simplification
Modern scanning devices allow to obtain a dense sample of discrete points from the surface of a physical object. A piecewise linear surface interpolating these points is computed to reconstruct the sampled surface. Typically such surfaces have a large combinatorial description since the input is usually too dense. In this paper we present an algorithm to decimate the samples to eliminate oversa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Graphics
سال: 2007
ISSN: 0097-8493
DOI: 10.1016/j.cag.2007.05.001